package class_0822Graph;

import java.util.ArrayList;

/**
 * @author 90774
 */
public class Node {
    //值
    public int value;
    //入度
    public int in;
    //出度
    public int out;
    //直接可达结点表:顶点V的所有相邻顶点的集合.====直接邻居
    public ArrayList<Node> nexts;
    //附近以该节点为起点的有向边.
    public ArrayList<Edge> edges;

    public Node(int value) {
        this.value = value;
        this.in = 0;
        this.out = 0;
        this.nexts = new ArrayList<>();
        this.edges = new ArrayList<>();
    }
}
